GRASS: Graph Spectral Sparsification Leveraging Scalable Spectral Perturbation Analysis
نویسندگان
چکیده
منابع مشابه
Spectral Sparsification in Dynamic Graph Streams
We present a new bound relating edge connectivity in a simple, unweighted graph with effective resistance in the corresponding electrical network. The bound is tight. While we believe the bound is of independent interest, our work is motivated by the problem of constructing combinatorial and spectral sparsifiers of a graph, i.e., sparse, weighted sub-graphs that preserve cut information (in the...
متن کاملA Sketching Algorithm for Spectral Graph Sparsification
We study the problem of compressing a weighted graph G on n vertices, building a “sketch” H of G, so that given any vector x ∈ R, the value xLGx can be approximated up to a multiplicative 1 + ǫ factor from only H and x, where LG denotes the Laplacian of G. One solution to this problem is to build a spectral sparsifier H of G, which, using the result of Batson, Spielman, and Srivastava, consists...
متن کاملSpectral Sparsification Spectral Sparsification: the Barrier Method and Its Applications
We survey recent literature focused on the following spectral sparsification question: Given an integer n and > 0, does there exist a function N(n, ) such that for every collection of C1, . . . ,Cm of n×n real symmetric positive semidefinite matrices whose sum is the identity, there exists a weighted subset of size N(n, ) whose sum has eigenvalues lying between 1− and 1 + ? We present the algor...
متن کاملTowards Scalable Spectral Clustering via Spectrum-Preserving Sparsification
The eigendeomposition of nearest-neighbor (NN) graph Laplacian matrices is the main computational bottleneck in spectral clustering. In this work, we introduce a highly-scalable, spectrum-preserving graph sparsification algorithm that enables to build ultra-sparse NN (u-NN) graphs with guaranteed preservation of the original graph spectrums, such as the first few eigenvectors of the original gr...
متن کاملSpectral Sparsification of Graphs
We introduce a new notion of graph sparsification based on spectral similarity of graph Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier approximate that of the original. This is equivalent to saying that the Laplacian of the sparsifier is a good preconditioner for the Laplacian of the original. We prove that every graph has a spectral sparsifier ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2020
ISSN: 0278-0070,1937-4151
DOI: 10.1109/tcad.2020.2968543